Discovering Search Algorithms with Program Transformation

Minimax is the basic algorithm used in two-persons player complete information computer games. It is also used in other games. Early research on the MiniMax algorithm have improved it giving the Alpha-Beta algorithm. We propose a list of program transformations that enable to rediscover the Alpha-Beta algorithm given the original MiniMax algorithm. This example is intended to serve as a basis for a more general program transformation system aimed at improving algorithms in games and problem solving. We also consider program transformation as a search algorithm, and outline the architecture of a system that can automatically perform the transformations we have described and its self-application.